Wastewater early warning system for SARS-CoV-2 outbreaks and variants in a Coruña, Spain.

Wastewater-based epidemiology has been widely used as a cost-effective method for tracking the COVID-19 pandemic at the community level. Here we describe COVIDBENS, a wastewater surveillance program running from June 2020 to March 2022 in the wastewater treatment plant of Bens in A Coruña (Spain). The main goal of this work was to provide an effective early warning tool based in wastewater epidemiology to help in decision-making at both the social and public health levels. RT-qPCR procedures and Illumina sequencing were used to weekly monitor the viral load and to detect SARS-CoV-2 mutations in wastewater, respectively. In addition, own statistical models were applied to estimate the real number of infected people and the frequency of each emerging variant circulating in the community, which considerable improved the surveillance strategy. Our analysis detected 6 viral load waves in A Coruña with concentrations between 103 and 106 SARS-CoV-2 RNA copies/L. Our system was able to anticipate community outbreaks during the pandemic with 8-36 days in advance with respect to clinical reports and, to detect the emergence of new SARS-CoV-2 variants in A Coruña such as Alpha (B.1.1.7), Delta (B.1.617.2), and Omicron (B.1.1.529 and BA.2) in wastewater with 42, 30, and 27 days, respectively, before the health system did. Data generated here helped local authorities and health managers to give a faster and more efficient response to the pandemic situation, and also allowed important industrial companies to adapt their production to each situation. The wastewater-based epidemiology program developed in our metropolitan area of A Coruña (Spain) during the SARS-CoV-2 pandemic served as a powerful early warning system combining statistical models with mutations and viral load monitoring in wastewater over time.

ViQUF: De Novo Viral Quasispecies Reconstruction Using Unitig-Based Flow Networks.

During viral infection, intrahost mutation and recombination can lead to significant evolution, resulting in a population of viruses that harbor multiple haplotypes. The task of reconstructing these haplotypes from short-read sequencing data is called viral quasispecies assembly, and it can be categorized as a multiassembly problem. We consider the de novo version of the problem, where no reference is available. We present ViQUF, a de novo viral quasispecies assembler that addresses haplotype assembly and quantification. ViQUF obtains a first draft of the assembly graph from a de Bruijn graph. Then, solving a min-cost flow over a flow network built for each pair of adjacent vertices based on their paired-end information creates an approximate paired assembly graph with suggested frequency values as edge labels, which is the first frequency estimation. Then, original haplotypes are obtained through a greedy path reconstruction guided by a min-cost flow solution in the approximate paired assembly graph. ViQUF outputs the contigs with their frequency estimations. Results on real and simulated data show that ViQUF is at least four times faster using at most half of the memory than previous methods, while maintaining, and in some cases outperforming, the high quality of assembly and frequency estimation of overlap graph-based methodologies, which are known to be more accurate but slower than the de Bruijn graph-based approaches.

Memory-Efficient Assembly Using Flye.

In the past decade, next-generation sequencing (NGS) enabled the generation of genomic data in a cost-effective, high-throughput manner. The most recent third-generation sequencing technologies produce longer reads; however, their error rates are much higher, which complicates the assembly process. This generates time- and space- demanding long-read assemblers. Moreover, the advances in these technologies have allowed portable and real-time DNA sequencing, enabling in-field analysis. In these scenarios, it becomes crucial to have more efficient solutions that can be executed in computers or mobile devices with minimum hardware requirements. We re-implemented an existing assembler devoted for long reads, more concretely Flye, using compressed data structures. We then compare our version with the original software using real datasets, and evaluate their performance in terms of memory requirements, execution speed, and energy consumption. The assembly results are not affected, as the core of the algorithm is maintained, but the usage of advanced compact data structures leads to improvements in memory consumption that range from 22% to 47% less space, and in the processing time, which range from being on a par up to decreases of 25%. These improvements also cause reductions in energy consumption of around 3-8%, with some datasets obtaining decreases up to 26%.

Inference of viral quasispecies with a paired de Bruijn graph.

MOTIVATION: RNA viruses exhibit a high mutation rate and thus they exist in infected cells as a population of closely related strains called viral quasispecies. The viral quasispecies assembly problem asks to characterize the quasispecies present in a sample from high-throughput sequencing data. We study the de novo version of the problem, where reference sequences of the quasispecies are not available. Current methods for assembling viral quasispecies are either based on overlap graphs or on de Bruijn graphs. Overlap graph-based methods tend to be accurate but slow, whereas de Bruijn graph-based methods are fast but less accurate. RESULTS: We present viaDBG, which is a fast and accurate de Bruijn graph-based tool for de novo assembly of viral quasispecies. We first iteratively correct sequencing errors in the reads, which allows us to use large k-mers in the de Bruijn graph. To incorporate the paired-end information in the graph, we also adapt the paired de Bruijn graph for viral quasispecies assembly. These features enable the use of long-range information in contig construction without compromising the speed of de Bruijn graph-based approaches. Our experimental results show that viaDBG is both accurate and fast, whereas previous methods are either fast or accurate but not both. In particular, viaDBG has comparable or better accuracy than SAVAGE, while being at least nine times faster. Furthermore, the speed of viaDBG is comparable to PEHaplo but viaDBG is able to retrieve also low abundance quasispecies, which are often missed by PEHaplo. AVAILABILITY AND IMPLEMENTATION: viaDBG is implemented in C++ and it is publicly available at https://bitbucket.org/bfreirec1/viadbg. All datasets used in this article are publicly available at https://bitbucket.org/bfreirec1/data-viadbg/. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.